Width and size of regular resolution proofs
نویسنده
چکیده
This paper discusses the topic of the minimum width of a regular resolution refutation of a set of clauses. The main result shows that there are examples having small regular resolution refutations, for which any regular refutation must contain a large clause. This forms a contrast with corresponding results for general resolution refutations.
منابع مشابه
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former system we show that the recently proposed algorithm of BenSasson and Wigderson [2] for searching for proofs cannot give better than weakly exponential performance. This is a consequence of showing optimality of their genera...
متن کاملOn Resolution Complexity of Matching Principles
Studying the complexity of mathematical proofs is important not only for automated theorem proving, but also for Mathematics as a whole. Each significant result in this direction would potentially have a great impact on Foundations of mathematics. Surprisingly enough, the general Proof Complexity is closely related to Propositional Proof Complexity. The latter area was founded by Cook and Reckh...
متن کاملMore on Size and Width in QBF Resolution
In their influential paper ‘Short proofs are narrow – resolution made simple’ [3], Ben-Sasson and Wigderson introduced a crucial tool for proving lower bounds on the lengths of proofs in the resolution calculus. Over a decade later their technique for showing lower bounds on the size of proofs, by examining the width of all possible proofs, remains one of the most effective lower bound techniqu...
متن کاملNarrow Proofs May Be Maximally Long (Extended Abstract)
We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n. This shows that the simple counting argument that any formula refutable in width w must have a proof in size n is essentially tight. Moreover, our lower bounds can be generalized to polynomial calculus resolution (PCR) and Sherali-Adams, implying that the...
متن کاملAre Short Proofs Narrow? QBF Resolution is not Simple
The groundbreaking paper ‘Short proofs are narrow – resolution made simple’ by Ben-Sasson and Wigderson (J. ACM 2001) introduces what is today arguably the main technique to obtain resolution lower bounds: to show a lower bound for the width of proofs. Another important measure for resolution is space, and in their fundamental work, Atserias and Dalmau (J. Comput. Syst. Sci. 2008) show that low...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 8 شماره
صفحات -
تاریخ انتشار 2011